Maximizing the numerical radii of matrices by permuting their entries
نویسندگان
چکیده
Let A be an n × n complex matrix such that every row and every column has at most one nonzero entry. We determine permutations of the nonzero entries of A so that the resulting matrix has maximum numerical radius. Extension of the results to operators acting on separable Hilbert spaces are also obtained. Related results and additional problems are also mentioned. AMS Subject Classification. 15A60.
منابع مشابه
Upper and lower bounds for numerical radii of block shifts
For an n-by-n complex matrix A in a block form with the (possibly) nonzero blocks only on the diagonal above the main one, we consider two other matrices whose nonzero entries are along the diagonal above the main one and consist of the norms or minimum moduli of the diagonal blocks of A. In this paper, we obtain two inequalities relating the numeical radii of these matrices and also determine ...
متن کاملSome results on higher numerical ranges and radii of quaternion matrices
Let $n$ and $k$ be two positive integers, $kleq n$ and $A$ be an $n$-square quaternion matrix. In this paper, some results on the $k-$numerical range of $A$ are investigated. Moreover, the notions of $k$-numerical radius, right $k$-spectral radius and $k$-norm of $A$ are introduced, and some of their algebraic properties are studied.
متن کاملNonlinear inelastic static analysis of plane frames with numerically generated tangent stiffness matrices
For the nonlinear analysis of structures using the well known Newton-Raphson Method, the tangent stiffness matrices of the elements must be constructed in each iteration. Due to the high expense required to find the exact tangent stiffness matrices, researchers have developed novel innovations into the Newton-Raphson method to reduce the cost and time required by the analysis. In this paper, a ...
متن کاملOn nest modules of matrices over division rings
Let $ m , n in mathbb{N}$, $D$ be a division ring, and $M_{m times n}(D)$ denote the bimodule of all $m times n$ matrices with entries from $D$. First, we characterize one-sided submodules of $M_{m times n}(D)$ in terms of left row reduced echelon or right column reduced echelon matrices with entries from $D$. Next, we introduce the notion of a nest module of matrices with entries from $D$. We ...
متن کاملThe Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
Neither the Council nor the Laboratory accept any responsibility for loss or damage arising from the use of information contained in any of their reports or in any communication about their tests or investigations. ABSTRACT We consider techniques for permuting a sparse matrix so that the diagonal of the permuted matrix has entries of large absolute value. We discuss various criteria for this an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012